The general Steiner problem in Boolean space and application

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The general Steiner problem in Boolean space and application

Ting, S.-T. and S.-Y. Zhao, The general Steiner problem in Boolean space and application, Discrete Mathematics 90 (1991) 75-84. The Steiner problem is to find the minimum point P of sum of distances C;=‘=,p=@(P)whereP,i=l,..., n, are given points in Euclidean plane. It is solved for n = 3, [l]. When n > 3 even approximation is unsatisfactory [3]. In Boolean space the distance of Boolean points ...

متن کامل

the relationship between academic self-concept and academic achievement in english and general subjects of the students of high school

according to research, academic self-concept and academic achievement are mutually interdependent. in the present study, the aim was to determine the relationship between the academic self-concept and the academic achievement of students in english as a foreign language and general subjects. the participants were 320 students studying in 4th grade of high school in three cities of noor, nowshah...

The General Steiner Tree-Star problem

The Steiner tree problem is deened as follows-given a graph G = (V; E) and a subset X V of terminals, compute a minimum cost tree that includes all nodes in X. Furthermore, it is reasonable to assume that the edge costs form a metric. This problem is NP-hard and has been the study of many heuristics and algorithms. We study a generalization of this problem, where there is a \switch" cost in add...

متن کامل

Solving the Euclidean Steiner Tree Problem in n-space

We present a specialized branch-and-bound (b&b) algorithm for the Euclidean Steiner tree problem (ESTP) in R and apply it to a convex mixed-integer nonlinear programming (MINLP) formulation of the problem, presented by Fampa and Maculan. The algorithm contains procedures to avoid difficulties observed when applying a b&b algorithm for general MINLP problems to solve the ESTP. Our main emphasis ...

متن کامل

The Fermat-Steiner Problem

Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org/about/terms.html. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive only for your perso...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Mathematics

سال: 1991

ISSN: 0012-365X

DOI: 10.1016/0012-365x(91)90097-l